Combinatorial Substitutions and Sofic Tilings
نویسندگان
چکیده
A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local constraints. This extends some similar previous results (Mozes’90, GoodmanStrauss’98) in a much shorter presentation.
منابع مشابه
A Primer of Substitution Tilings of the Euclidean Plane
This paper is intended to provide an introduction to the theory of substitution tilings. For our purposes, tiling substitution rules are divided into two broad classes: geometric and combinatorial. Geometric substitution tilings include self-similar tilings such as the well-known Penrose tilings; for this class there is a substantial body of research in the literature. Combinatorial substitutio...
متن کاملuniform distribution theory MULTIDIMENSIONAL EFFECTIVE S - ADIC SUBSHIFTS ARE SOFIC
In this article we prove that multidimensional effective S-adic systems, obtained by applying an effective sequence of substitutions chosen among a finite set of substitutions, are sofic subshifts. Communicated by Pierre Liardet
متن کاملMultidimensional effective S-adic systems are sofic
In this article we prove that multidimensional effective Sadic systems, obtained by applying an effective sequence of substitutions chosen among a finite set of substitutions, are sofic subshifts.
متن کاملSubshifts, Languages and Logic
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tilings. Conversely, we characterise logic fragments corresponding to various classes of infinite pictures (subshifts of finite type, sofic subshifts).
متن کاملCombinatorial Independence and Sofic Entropy
We undertake a local analysis of combinatorial independence as it connects to topological entropy within the framework of actions of sofic groups.
متن کامل